A Logic of Composition for Information Flow Predicates
نویسندگان
چکیده
Information $ow predicates are properties of sets of traces and therefore cannot be handled under the Alpern-Schneider framework and the Abadi-Lnmport Composition Principle. McLean proposed a theory in iMCL941 to investigate the composition properties of these predicates and derived a partial order on them. In this paper we present an alternate framework based on many-sorted predicate logic for specifying the informat ionjow properties and show that this framework can be used to reason about the composition of such properties that is amenable to automated theorem proving.
منابع مشابه
SOFT TOPOLOGY AND SOFT PROXIMITY AS FUZZY PREDICATES BY FORMULAE OF LUKASIEWICZ LOGIC
In this paper, based in the L ukasiewicz logic, the definition offuzzifying soft neighborhood structure and fuzzifying soft continuity areintroduced. Also, the fuzzifying soft proximity spaces which are ageneralizations of the classical soft proximity spaces are given. Severaltheorems on classical soft proximities are special cases of the theorems weprove in this paper.
متن کاملA semantic-aware role-based access control model for pervasive computing environments
Access control in open and dynamic Pervasive Computing Environments (PCEs) is a very complex mechanism and encompasses various new requirements. In fact, in such environments, context information should be used in access control decision process; however, it is not applicable to gather all context information completely and accurately all the time. Thus, a suitable access control model for PCEs...
متن کاملCAMAC: a context-aware mandatory access control model
Mandatory access control models have traditionally been employed as a robust security mechanism in multilevel security environments such as military domains. In traditional mandatory models, the security classes associated with entities are context-insensitive. However, context-sensitivity of security classes and flexibility of access control mechanisms may be required especially in pervasive c...
متن کاملCompositionality and Reachability with Conditions on Path Lengths
In model-checking the systems under investigation often arise in the form of products. The compositional method, developed by Feferman and Vaught in 1959, fits to this situation and can be used to deduce the truth of a formula in the product from information in the factors. Building on earlier work of Wöhrle and Thomas (2004), we study first-order logic with reachability predicates over finitel...
متن کاملObservation Predicates in Flow Logic
Motivated by the connection between strong and soft type systems we explore flow analyses with hard constraints on the admissible solutions. We show how to use observation predicates and formula rearrangements to map flow analyses with hard constraints into more traditional flow analyses in such a way that the hard constraints are satisfied exactly when the observation predicates report no viol...
متن کامل